Solving diversified top-k weight clique search problem
نویسندگان
چکیده
منابع مشابه
Diversified Top-k Partial MaxSAT Solving
We introduce a diversified top-k partial MaxSAT problem, a combination of partial MaxSAT problem and enumeration problem. Given a partial MaxSAT formula F and a positive integer k, the diversified top-k partial MaxSAT is to find k maximal solutions for F such that the k maximal solutions satisfy the maximum number of soft clauses of F . This problem can be widely used in many applications inclu...
متن کاملSolving the Top-K Problem with Fixed-Memory Heuristic Search
The Top-K problem is defined as follows. Given L lists of real numbers, find the top K scoring L-tuples. A tuple is scored by the sum of its components. Rare event modeling and event ranking are often reduced to the Top-K problem. In this paper, we present the application of a fixedmemory heuristic search algorithm (namely, SMA*) and its distributed-memory extension to the Top-K problem. Our ap...
متن کاملDiversified Top-k Similarity Search in Large Attributed Networks
Given a large network and a query node, finding its top-k similar nodes is a primitive operation in many graphbased applications. Recently enhancing search results with diversification have received much attention. In this paper, we explore an novel problem of searching for top-k diversified similar nodes in attributed networks, with the motivation that modeling diversification in an attributed...
متن کاملFast Solving Maximum Weight Clique Problem in Massive Graphs
This paper explores techniques for fast solving the maximum weight clique problem (MWCP) in very large scale real-world graphs. Because of the size of such graphs and the intractability of MWCP, previously developed algorithms may not be applicable. Although recent heuristic algorithms make progress in solving MWCP in massive graphs, they still need considerable time to get a good solution. In ...
متن کاملExtending Bron Kerbosch for Solving the Maximum Weight Clique Problem
This contribution extends the Bron Kerbosch algorithm for solving the maximum weight clique problem, where continuous-valued weights are assigned to both, vertices and edges. We applied the proposed algorithm to graph matching problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2021
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-020-3069-4